On duals and parity-checks of convolutional codes over Zpr

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Low-Density Parity-Check Convolutional Codes

Abstract – In this paper a formal theory, construction methods, and a random ensemble approach for low-density parity-check convolutional codes (including turbo-codes) are presented. The principles of iterative decoding of low-density parity-check (LDPC) convolutional codes are given, and an iterative algorithm for decoding of homogeneous LDPC convolutional codes is described. Some simulation r...

متن کامل

Cross parity check convolutional codes

Ahstrrrct-A class of convolutional codes called cross parity check (CPC) codes, useful for the protection of data stored on magnetic tape, is described and analyzed. CPC codes are first explained geometrically; their construction is described in terms of constraining data written onto a tape in such a way that, when lines of varying slope are drawn across the tape, the bits falling on those lin...

متن کامل

CYCLIC CODES AND THEIR DUALS OVER Zm

In this paper we study the cyclic codes over Zm as being Zm-submodules of ZmG and we find their minimal generating sets. We also study the dual codes of cyclic codes and find their generators as being ideals in ZmG. Throughout this paper, we assume m = q, q is a prime number and (n, q) = 1.

متن کامل

Convolutional Codes Over Rings

Convolutional codes over rings behave quite differently from convolutional codes over fields, but they are the ones best suited for phase modulation. This behavior depends strongly on the structure of the underlying ring. Some basic concepts about ring convolutional codes, in particular over Zpr , and their structural properties such as basicity, systematicity, non-catastrophicity and minimalit...

متن کامل

Convolutional Codes Over Rings

Elementary information about convolutional codes over finite fields is introduced, and various motivations for extension to convolutional codes over finite rings are discussed. The recent primary motivation is found to be for use over phase modulation signals. Such ring codes enjoy the special property of phase weight equal to phase distance equal to the squared Euclidean distance between phase...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2019

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2018.08.012